Study of the MAP/GI/∞ Queueing System with Random Customers' Capacities
نویسندگان
چکیده
Abstract. In this paper a queuing system with an in nite number of servers is considered. Customers arrive in the system according to a Markovian Arrival Process. Each customer carries a random quantity of work (capacity of the customer). In this study service time does not depend on the customers' capacities; the latter are used just to x some additional features of the system evolution. It is shown that the joint probability distribution of the customers' number and total capacities in the system is two-dimensional Gaussian under the asymptotic condition of an in nitely growing service time.
منابع مشابه
Discrete Time Analysis of Multi-Server Queueing System with Multiple Working Vacations and Reneging of Customers
This paper analyzes a discrete-time $Geo/Geo/c$ queueing system with multiple working vacations and reneging in which customers arrive according to a geometric process. As soon as the system gets empty, the servers go to a working vacations all together. The service times during regular busy period, working vacation period and vacation times are assumed to be geometrically distributed. Customer...
متن کاملA MAP/G/1 Queue with Negative Customers
In this paper, we consider a MAP/G/1 queue with MAP arrivals of negative customers, where there are two types of service times and two classes of removal rules: the RCA and RCH, as introduced in Section 2. We provide an approach for analyzing the system. This approach is based on the classical supplementary variable method, combined with the matrix-analytic method and the censoring technique. B...
متن کاملA Monotonicity Result for the Blocking Probability in a G/GI/c/m Queueing System
We prove a slightly more general version of the following: In a G/GI/c/m queueing system where arriving customers are randomly deleted with probability 1 − p, the blocking probability of the remaining customers must be non-decreasing in p. In particular, we show that if more customers are accepted, even with a possibly different service time distribution, the blocking probability is at least as...
متن کاملWorking Vacation Queue with Second Optional Service and Unreliable Server
An M/M/1 queueing system with second optional service and unreliable server is studied. We consider that the server works at different rate rather than being idle during the vacation period. The customers arrive to the system according to Poisson process with state dependent rates depending upon the server’s status. All customers demand the first essential service whereas only some of them dema...
متن کاملDIFFUSION APPROXIMATION FOR GI / G / l QUEUEING SYSTEMS WITH FINITE CAPACITY : I - THE FIRST OVERFLOW TIME
A GI/G/1 queueing system with finite capacity il studied. The first overflow time, which means the time when the number of customers first exceeds the capacity, is analyzed by diffusion approximation. Approximate expressions for the distribution and moments of the first overflow time are derived explicitly. These results are modified so as to be more accurate for an M/G/I system or a system wit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017